Generalized Loop-Unrolling: a Method for Program Speed-Up
نویسندگان
چکیده
It is well-known that, to optimize a program for speed-up, efforts should be focused on the regions where the payoff will be greatest. Loop constructs in a program represent such regions. In the literature, it has been shown that a certain degree of speed-up can be achieved by loop unrolling. The technique published so far, however, appears to be applicable to FOR-loops only. This paper presents a generalized loop-unrolling method that can be applied to any type of loop construct. Possible complications in its applications, together with some experimental results, are discussed in detail.
منابع مشابه
An Improving Method for Loop Unrolling
In this paper we review main ideas mentioned in several other papers which talk about optimization techniques used by compilers. Here we focus on loop unrolling technique and its effect on power consumption, energy usage and also its impact on program speed up by achieving ILP (Instruction-level parallelism). Concentrating on superscalar processors, we discuss the idea of generalized loop unrol...
متن کاملExtending Loop Unrolling and Shifting for Reconfigurable Architectures
Loops are an important source of optimization. In this paper, we propose an extension to our work on loop unrolling and loop shifting for reconfigurable architectures. By applying unrolling and shifting to a small loop containing a hardware kernel and some software code, we relocate the function calls contained in the loop body such that in every iteration of the transformed loop, software func...
متن کاملOptimizing the Cyclic Jacobi Algorithm of Singular Value Decomposition for DLX Architecture
This project focussed on speeding up the cyclic Jacobi algorithm of the Singular Value Decomposition for DLX architecture. Using the performance monitor, it is shown that over 96% of the time is spent in a subroutine calculates Jacobi rotations. To speed up the subroutine, the improvement are performed on two aspects. From the algorithm point of view, we rst implemented the fast Jacobi matrix m...
متن کاملMaximally Fast and Arbitrarily Fast Hardware Efficient Implementation of Linear and Feedback Linear Computations1
By establishing a relationship between the basic properties of linear computations (additivity and homogeneity) and eight optimizing transformations (distributivity, associativity, commutativity, inverse and zero element law, common subexpression replication and elimination and constant propagation), a CAD platform is developed to optimally speed-up an arbitrary instance from this large class o...
متن کاملPoster: Loop Circuit Optimization with Bootstrapping over Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) enables us to compute arbitrary circuits over encrypted data without decryption. To evaluate a complex circuit, a time-consuming operation called bootstrapping is required. Reducing the number of bootstrapping operations leads directly to reducing the entire computation time of the circuit. An optimization problem which minimizes the number of bootstrapping op...
متن کامل